Separoids and characterization of linear uniform oriented matroids
نویسندگان
چکیده
In this paper the geometric dimension of an oriented matroid is introduced. It is the minimal euclidian dimension where its separoid (to be defined) can be realized as a family of convex sets. We show that in the uniform case, it is enough to know this invariant to decide if the oriented matroid is linear .
منابع مشابه
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretical representations of oriented matroids, and all these methods work in general rank and for nonuniform and uniform oriented matroids as well. We consider two types of graphs, cocircuit graphs and tope graphs, and discus...
متن کاملA characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J. Folkman, J. Lawrence, Oriented matroids, J. Combin. Theory Ser. B 25 (1978) 199–236]. In this paper we exhibit a characterization of such graphs (for the uniform case) via their natural embedding into Qn—the 1-skeleto...
متن کاملOn tope graphs of complexes of oriented matroids
We give two graph theoretical characterizations of tope graphs of (complexes of) oriented matroids. The first is in terms of excluded partial cube minors, the second is that all antipodal subgraphs are gated. A direct consequence is a third characterization in terms of zone graphs of tope graphs. Further corollaries include a characterization of topes of oriented matroids due to da Silva, anoth...
متن کاملCOMs: Complexes of oriented matroids
In his seminal 1983 paper, Jim Lawrence introduced lopsided sets and featured them as asymmetric counterparts of oriented matroids, both sharing the key property of strong elimination. Moreover, symmetry of faces holds in both structures as well as in the so-called affine oriented matroids. These two fundamental properties (formulated for covectors) together lead to the natural notion of “condi...
متن کاملThe Linear Complementarity Problem on Oriented
The linear complementarity problem (LCP) is one of the most widely studied mathematical programming problems. The theory of LCP can be extended to oriented matroids which are combinatorial abstractions of linear subspaces of Euclidean spaces. This paper briefly surveys the LCP, oriented matroids and algorithms for the LCP on oriented matroids. key words: linear complementarity problem, oriented...
متن کامل